Password Cracking Based On Rainbow Tables With A Dynamically Coarse Grain Reconfigurable Architecture
نویسندگان
چکیده
Rainbow attack is a very efficient attack which uses rainbow tables to offer an almost optimal time-memory tradeoff in the process of recovering the plaintext password from ciphertext hash. In this paper, we proposed a new method which can crack DES password quickly with less power consumption on a coarse grain reconfigurable architecture (CGRA) named reconfigurable encrypt-decrypt system (REEDS). To the best of our knowledge, this is the first try for password cracking based on “Rainbow Tables” under a dynamically CGRA platform presented in the literature. High parallel computing capability and good flexibility make the platform an excellent candidate to process multimedia application, encryption and decryption algorithm etc. In this paper, the whole work of DES password cracking based on rainbow tables is split into several sub tasks, which are mapped onto REEDS respectively and executed in parallel using pipeline approach. Experimental results show that the proposed system with 200 MHz clock rate can fulfill the DES password cracking task with great performance, which is up to 2000 times faster than the corresponding software approach. Moreover, it only consumes 194mW power which is less than the FPGA-based system or the GPU-based system.
منابع مشابه
Analysis of Password Cracking Methods & Applications
This project examines the nature of password cracking and modern applications. Several applications for different platforms are studied. Different methods of cracking are explained, including dictionary attack, brute force, and rainbow tables. Password cracking across different mediums is examined. Hashing and how it affects password cracking is discussed. An implementation of two hash-based pa...
متن کاملVirtual Expansion of Rainbow Tables
Password recovery tools are often used in digital forensic investigations to obtain the passwords that are used by suspects to encrypt potential evidentiary data. This paper presents a new method for deterministically generating and efficiently storing password recovery tables. The method, which involves the virtual expansion of rainbow tables, achieves improvements of 16.92% to 28.15% in the p...
متن کاملDiscarding the Endpoints makes the Cryptanalytic Time-Memory Trade-Offs even Faster
Cryptanalytic time-memory trade-offs were introduced by Hellman in 1980 in order to perform key-recovery attacks on cryptosystems. A major advance was presented at Crypto 2003 by Oechslin, with the rainbow table variant that outperforms Hellman’s seminal work. This paper introduces the fingerprint tables, which drastically reduce the number of false alarms during the attack compared to the rain...
متن کاملA Reconfigurable Network-on-Chip Datapath for Application Specific Computing
This paper introduces a new datapath architecture for reconfigurable processors. The proposed datapath is based on Network-on-Chip approach and facilitates tight coupling of all functional units. Reconfigurable functional elements can be dynamically allocated for application specific optimizations, enabling polymorphic computing. Using a modified network simulator, performance of several NoC to...
متن کاملA design flow for speeding-up dsp applications in heterogeneous reconfigurable systems
In this paper, we propose a method for speeding-up Digital Signal Processing applications by partitioning them between the reconfigurable hardware blocks of different granularity and mapping critical parts of applications on coarse-grain reconfigurable hardware. The reconfigurable hardware blocks are embedded in a heterogeneous reconfigurable system architecture. The fine-grain part is implemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Intelligent Automation & Soft Computing
دوره 18 شماره
صفحات -
تاریخ انتشار 2012